Decomposed Process Mining with DivideAndConquer
نویسنده
چکیده
Many known process mining techniques scale badly in the number of activities in an event log. Examples of such techniques include the ILP Miner and the standard replay, which also uses ILP techniques. To alleviate the problems these techniques face, we can decompose a large problem (with many activities) into a number of small problems (with few activities). Expectation is, that the run times of such a decomposed setting will be faster than the run time of the original setting. This paper presents the DivideAndConquer tool, which allows the user to decompose a large problem into small problems, to run the desired discovery or replay technique on each of these decomposed problems, and to merge the results into a single result, which can then be shown to the user.
منابع مشابه
Finding Suitable Activity Clusters for Decomposed Process Discovery
Event data can be found in any information system and provide the starting point for a range of process mining techniques. The widespread availability of large amounts of event data also creates new challenges. Existing process mining techniques are often unable to handle “big event data” adequately. Decomposed process mining aims to solve this problem by decomposing the process mining problem ...
متن کاملDecomposed Process Mining: The ILP Case
Over the last decade process mining techniques have matured and more and more organizations started to use process mining to analyze their operational processes. The current hype around “big data” illustrates the desire to analyze ever-growing data sets. Process mining starts from event logs—multisets of traces (sequences of events)—and for the widespread application of process mining it is vit...
متن کاملDecomposed Replay Using Hiding and Reduction
In the area of process mining, decomposed replay has been proposed to be able to deal with nets and logs containing many different activities. The main assumption behind this decomposition is that replaying many subnets and sublogs containing only some activities is faster then replaying a single net and log containing many activities. Although for many nets and logs this assumption does hold, ...
متن کاملERP Event Log Preprocessing: Timestamps vs. Accounting Logic
Process mining has been gaining significant attention in academia and practice. A promising first step to apply process mining in the audit domain was taken with the mining of process instances from accounting data. However, the resulting process instances constitute graphs. Commonly, timestamp oriented event log formats require a sequential list of activities and do not support graph structure...
متن کاملProcess Model Discovery: A Method Based on Transition System Decomposition
Process mining aims to discover and analyze processes by extracting information from event logs. Process mining discovery algorithms deal with large data sets to learn automatically process models. As more event data become available there is the desire to learn larger and more complex process models. To tackle problems related to the readability of the resulting model and to ensure tractabilit...
متن کامل